Foundations of the Trace Assertion Method of Module Interface Specification

نویسندگان

  • Ryszard Janicki
  • Emil Sekerinski
چکیده

The trace assertion method is a formal state machine based method for specifying module interfaces. A module interface specification treats the module as a black-box, identifying all module’s access programs (i.e. programs that can be invoked from outside of the module), and describing their externally visible effects. In the method, both the module states and the behaviors observed are fully described by traces built from access program invocations and their visible effects. A formal model for the trace assertion method is proposed. The concept of step-traces is introduced and applied. The stepwise refinement of trace assertion specifications is considered. The role of non-determinism, normal and exceptional behavior, value functions and multi-object modules are discussed. The relationship with algebraic specifications is analyzed. A tabular notation for writing trace specifications to ensure readability is adapted.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Foundations of the Trace Assertion Method of Module Interface Speci cation

The trace assertion method is a formal state machine based method for specifying module interfaces ([3, 15, 25, 28, 32, 36]). A module interface speci cation treats the module as a black-box, identifying all module's access programs (i.e. programs that can be invoked from outside of the module), and describing their externally visible e ects. A formal model for the trace assertion method is pro...

متن کامل

Specifying Module Interfaces with Finitely Defined Automata

The use of automata as a specification tool is analyzed. Trace Assertion Method (TAM) is used as an example. TAM is a formal method for specifying module interfaces. It treats the module as a black box, and was designed as an alternative to an algebraic specification technique [1], and became quite popular in the software industry [13]. Finiteness and concurrency issues are discussed. Key–Words...

متن کامل

8 Trace Only Automata 179 Trace Assertion

The trace assertion method is a formal state machine based method for specifying module A module interface speciication treats the module as a black-box, identifying all module's access programs (i.e. programs that can be invoked from outside of the module), and describing their externally visible eeects. A formal model for the trace assertion method is proposed. The concept of step-traces is i...

متن کامل

Trace Specifications of Non-Deterministic Multi-Object Modules

The Trace Assertion Method (in short: TAM) is a formal method for abstract specification of interfaces of software modules being designed according to the “information hiding” principle. A trace specification is a “black-box” specification, i.e., it describes only those features of a module that are externally observable. The method was introduced by W. Bartusek and D.L. Parnas some 15 years ag...

متن کامل

Representation of Semiautomata by Canonical Words and Equivalences, Part II: Specification of Software Modules

A theory of representation of semiautomata by canonical words and equivalences was developed in [7]. That work was motivated by trace-assertion specifications of software modules, but its focus was entirely on the underlying mathematical model. In the present paper we extend that theory to automata with Moore and Mealy outputs, and show how to apply the extended theory to the specification of m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Software Eng.

دوره 27  شماره 

صفحات  -

تاریخ انتشار 2001